On Pseudorandomness in Families of Sequences Derived from the Legendre Symbol
نویسنده
چکیده
Abstract. We construct a family of finite binary sequences which has a remarkable uniformity with respect to specification of several terms and which also has the property that every sequence in the family has small measures of normality, well distribution in arithmetical progressions and multiple correlations. We also construct a pseudorandom bit generator whose output consists of members of the family.
منابع مشابه
Construction of large families of pseudo-random binary sequences
In a series of papers Mauduit and S arkozy (partly with coauthors) studied nite pseudorandom binary sequences. They showed that the Legendre symbol forms a \good" pseudorandom sequence, and they also tested other sequences for pseudorandomness, however, no large family of \good" pseudorandom sequences has been found yet. In this paper, a large family of this type is constructed. Again, the con...
متن کاملOn the complexity of a family related to the Legendre symbol
Ahlswede, Khachatrian, Mauduit and A. Sárközy introduced the notion family-complexity of families of binary sequences. They estimated the family-complexity of a large family related to Legendre symbol introduced by Goubin, Mauduit and Sárközy. Here their result is improved, and apart from the constant factor the best lower bound is given for the family-complexity. 2000 AMS Mathematics Subject C...
متن کاملOn finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol by Christian Mauduit (Marseille) and András Sárközy (Budapest) 1. Introduction. In the last 60 years numerous papers have been written on pseudorandom sequences (we shall also write PR for pseudoran-domness). In these papers a wide range of goals, approaches, and tools is presented; even the concept of "...
متن کاملOn the complexity of a family based on irreducible polynomials
Ahlswede, Khachatrian, Mauduit and Sárközy [1] introduced the f -complexity measure (“f ” for family) in order to study pseudorandom properties of large families of binary sequences. So far several families have been studied by this measure. In the present paper I considerably improve on my earlier result in [7], where the f -complexity measure of a family based on the Legendre symbol and polyn...
متن کاملA complexity measure for families of binary sequences
In earlier papers finite pseudorandom binary sequences were studied, quantitative measures of pseudorandomness of them were introduced and studied, and large families of “good” pseudorandom sequences were constructed. In certain applications (cryptography) it is not enough to know that a family of “good” pseudorandom binary sequences is large, it is a more important property if it has a “rich”,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004